M ar 2 00 7 What is the Inverse of Repeated Square and Multiply Algorithm ?
نویسندگان
چکیده
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete logarithm over finite fields and their time complexity are given by bypassing this difficulty. One of the algorithms was inspired by the famous 3x+ 1 problem.
منابع مشابه
2 00 7 What is the Inverse of Repeated Square and Multiply Algorithm ?
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of...
متن کاملar X iv : m at h / 06 02 15 4 v 1 [ m at h . N T ] 8 F eb 2 00 6 What is the Inverse of Repeated Square and Multiply Algorithm ?
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not...
متن کاملWhat is the Inverse of Repeated Square and Multiply Algorithm?
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of...
متن کاملar X iv : 0 70 5 . 01 68 v 2 [ m at h . PR ] 9 M ay 2 00 7 BROWNIAN SUBORDINATORS AND FRACTIONAL CAUCHY PROBLEMS
A Brownian time process is a Markov process subordinated to the absolute value of an independent one-dimensional Brownian motion. Its transition densities solve an initial value problem involving the square of the generator of the original Markov process. An apparently unrelated class of processes, emerging as the scaling limits of continuous time random walks, involve subordination to the inve...
متن کاملar X iv : g r - qc / 0 21 00 53 v 1 1 7 O ct 2 00 2 STUDY OF THE COINCIDENCES BETWEEN THE GRAVITATIONAL WAVE DETECTORS EXPLORER AND NAUTILUS IN THE YEAR 2001
We report the result from a search for bursts of gravitational waves using data collected by the cryogenic resonant detectors EXPLORER and NAUTILUS during the year 2001, for a total measuring time of 90 days. With these data we repeated the coincidence search performed on the 1998 data (which showed a small coincidence excess) applying data analysis algorithms based on known physical characteri...
متن کامل